- query decomposition
- декомпозиция запроса
English-Russian dictionary of computer science. 2015.
query decomposition
Смотреть что такое "query decomposition" в других словарях:
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Conjunctive query — In database theory, a conjunctive query is a restricted form of first order queries. A large part of queries issued on relational databases can be written as conjunctive queries, and large parts of other first order queries can be written as… … Wikipedia
Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… … Wikipedia
Concept Search — A concept search (or conceptual search) is an automated information retrieval method that is used to search electronically stored unstructured text (for example, digital archives, email, scientific literature, etc.) for information that is… … Wikipedia
Latent semantic analysis — (LSA) is a technique in natural language processing, in particular in vectorial semantics, of analyzing relationships between a set of documents and the terms they contain by producing a set of concepts related to the documents and terms. LSA was … Wikipedia
Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… … Wikipedia
Outhouse — This article is about a type of building or structure used primarily as a toilet . For other uses, see Outhouse (disambiguation). An outhouse at Goat Peak, 6,305 ft (1,922 m) above sea level An outhouse is a small structure separate from a main… … Wikipedia
List of works by Joseph Priestley — This list of works by Joseph Priestley classifies all of the works by Joseph Priestley (1733 – 1804), a British natural philosopher, Dissenting clergyman, political theorist, theologian, and educator. He is best known for his discovery,… … Wikipedia
Liste des œuvres de Joseph Priestley — Priestley, paint à la fin de sa vie par Rembrandt Peale (vers 1800) Cette liste des œuvres de Joseph Priestley classifie tous les ouvrages de Joseph Priestley (1733 1804), philosophe naturel britannique, prêtre dissident, philosophe politique,… … Wikipédia en Français
Dynamization — In computer science, Dynamization is the process of transforming a static data structure into a dynamic one. Although static data structures may provide very good functionality and fast queries, their utility is limited because of their inability … Wikipedia
